PRISM

Benchmark
Model:csma v.1 (MDP)
Parameter(s)N = 4, K = 2
Property:all_before_max (prob-reach)
Invocation (specific)
./fix-syntax ./prism -javamaxmem 11g -cuddmaxmem 4g -ii -e 5e-2 -heuristic speed -ddextraactionvars 100 -maxiters 1000000 csma.4-2.prism csma.props --property all_before_max
Execution
Walltime:64.97968029975891s
Return code:0
Relative Error:0.010578581794496715
Log
PRISM
=====

Version: 4.5.dev
Date: Sat Mar 14 17:02:22 UTC 2020
Hostname: e72bdd194fc5
Memory limits: cudd=4g, java(heap)=11g
Command line: prism -javamaxmem 11g -cuddmaxmem 4g -ii -e 5e-2 -heuristic speed -ddextraactionvars 100 -maxiters 1000000 csma.4-2.prism csma.props --property all_before_max

Parsing model file "csma.4-2.prism"...

Type:        MDP
Modules:     bus station1 station2 station3 station4 
Variables:   b y1 y2 s1 x1 bc1 cd1 s2 x2 bc2 cd2 s3 x3 bc3 cd3 s4 x4 bc4 cd4 

Parsing properties file "csma.props"...

5 properties:
(1) "all_before_max": Pmax=? [ !"collision_max_backoff" U "all_delivered" ]
(2) "all_before_min": Pmin=? [ !"collision_max_backoff" U "all_delivered" ]
(3) "some_before": Pmin=? [ F min_backoff_after_success<K ]
(4) "time_max": R{"time"}max=? [ F "all_delivered" ]
(5) "time_min": R{"time"}min=? [ F "all_delivered" ]

---------------------------------------------------------------------

Model checking: "all_before_max": Pmax=? [ !"collision_max_backoff" U "all_delivered" ]

Warning: Switching to sparse engine and (backwards) Gauss Seidel (default for heuristic=speed).

Building model...

Computing reachable states...

Reachability (BFS): 193 iterations in 2.15 seconds (average 0.011130, setup 0.00)

Time for model construction: 2.238 seconds.

Type:        MDP
States:      761962 (1 initial)
Transitions: 1327068
Choices:     825504

Transition matrix: 52233 nodes (4 terminal), 1327068 minterms, vars: 54r/54c/17nd

Prob0A: 186 iterations in 3.48 seconds (average 0.018720, setup 0.00)

Prob1E: 1017 iterations in 30.04 seconds (average 0.029533, setup 0.00)

yes = 142601, no = 25408, maybe = 593953

Computing remaining probabilities...
Engine: Sparse

Building quotient MDP, collapsing maximal end components as well as yes and no states...
Time for computing maximal end components: 4.947 seconds, found 0 MECs.
Time for building MEC quotient: 18.261 seconds.

Quotient MDP:
States:      593955 (1 initial)
Transitions: 1098047
Choices:     654659

Transition matrix: 348651 nodes (5 terminal), 1098047 minterms, vars: 54r/54c/72nd
Note: Interval iteration is configured to enforce monotonicity from below.

Building sparse matrix... [n=593955, nc=649787, nnz=1093175, k=4] [13.7 MB]
Creating vector for yes... [4.5 MB]
Creating vector for maybe... [4.5 MB]
Allocating iteration vectors... [4 x 4.5 MB]
TOTAL: [40.9 MB]

Starting iterations (interval iteration)...
Max relative diff between upper and lower bound on convergence: 0.0457689
Iterative method (interval iteration): 145 iterations in 3.56 seconds (average 0.017752, setup 0.98)

Value in the initial state: 0.768246302113283

Time for model checking: 61.91 seconds.

Result: 0.768246302113283 (value in the initial state)


Overall running time: 64.74 seconds.

---------------------------------------------------------------------

Note: There was 1 warning during computation.